Answer Sets for Prioritized
نویسنده
چکیده
Connict resolution is an important issue in knowledge representation and reasoning. A common idea of solving connicts in reasoning is to add preferences in the underlying reasoning mechanism. This paper describes extensions of Gelfond and Lifschitz's extended logic programs 5] by adding preference information. We rst propose prioritized logic programs (PLPs) in which the preference is expressed statically. An extended answer set semantics is provided for PLPs. We then extend PLPs to dynamic PLPs (DPLPs) in which the preference can be expressed dynamically. The semantics of DPLPs is deened in terms of answer sets of the corresponding PLPs. By illustrating typical examples, we show how connicts between rules are resolved in PLPs and DPLPs. We also investigate basic properties of PLPs and DPLPs in detail.
منابع مشابه
Preferred answer sets supported by arguments
We are aiming at a semantics of prioritized logic programs which always selects a preferred answer set, if there is a nonempty set of (standard) answer sets of the given program. It is shown in a seminal paper by Brewka and Eiter that the goal mentioned above is incompatible with their second principle and it is not satisfied in their semantics of prioritized logic programs. Similarly, also acc...
متن کاملImplementing Prioritized Logic Programming
Connict resolution is an important issue in knowledge representation and reasoning. A common idea of solving connicts in reasoning is to introduce priorities in the underlying reasoning mechanism. This paper describes an implementation of prioritized logic programs (PLPs) proposed by Zhang and Foo recently 4]. PLPs is a non-trivial extension of Gelfond and Lifschitz's extended logic programs 3]...
متن کامل0pt Preferred Answer Sets for Extended Logic Programs
In this paper, we extend Gelfond and Lifschitz’s answer set semantics to prioritized extended logic programs. In such programs, an ordering on the program rules is used to express preferences. We show how this ordering can be used to define preferred answer sets and thus to increase the set of consequences of a program. We define a strong and a weak notion of preferred answer sets. The first ta...
متن کاملPreferred Answer Sets for Extended Logic Programs
In this paper, we extend Gelfond and Lifschitz’s answer set semantics to prioritized extended logic programs. In such programs, an ordering on the program rules is used to express preferences. We show how this ordering can be used to define preferred answer sets and thus to increase the set of consequences of a program. We define a strong and a weak notion of preferred answer sets. The first ta...
متن کاملOn the Semantics of Logic Programs with Preferences
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation for prioritized logic programs, is inspired by the semantics of Prioritized Logic Programming and enriched with the use of structural information of preference of Answer Set Optimization Programming. Specifically, the an...
متن کامل